An exponential lower bound for real-time branching programs
نویسندگان
چکیده
منابع مشابه
A Non-linear Time Lower Bound for Boolean Branching Programs
We give an exponential lower bound for the size of any linear-time Boolean branching program computing an explicitly given function. More precisely, we prove that for all positive integers k and for all sufficiently small ε > 0, if n is sufficiently large then there is no Boolean (or 2-way) branching program of size less than 2εn which, for all inputs X ⊆ {0,1, . . .,n− 1}, computes in time kn ...
متن کاملParity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still ope...
متن کاملRestricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication
Branching programs are a well established computation model for Boolean functions, especially read-once branching programs have been studied intensively. In this paper the expressive power of nondeterministic read-once branching programs, i.e., the class of functions representable in polynomial size, is investigated. For that reason two restricted models of nondeterministic read-once branching ...
متن کاملA Quadratic Lower Bound for Homogeneous Algebraic Branching Programs
An algebraic branching program (ABP) is a directed acyclic graph, with a start vertex s, and end vertex t and each edge having a weight which is an affine form in F[x1, x2, . . . , xn]. An ABP computes a polynomial in a natural way, as the sum of weights of all paths from s to t, where the weight of a path is the product of the weights of the edges in the path. An ABP is said to be homogeneous ...
متن کاملA Superpolynomial Lower Bound for (1, +k(n))-Branching Programs
By k n branching programs b p s we mean those b p s which during each of their computations are allowed to test at most k n input bits repeatedly For a Boolean function J computable within polynomial time a trade o has been proven between the number of repeatedly tested bits and the size of each b p P which computes J If at most bpn log c n c repeated tests are allowed then the size of P is at ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1986
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80018-3